A Note on the Classification of the Most Simple Asynchronous Cellular Automata
Identifieur interne : 001664 ( Main/Exploration ); précédent : 001663; suivant : 001665A Note on the Classification of the Most Simple Asynchronous Cellular Automata
Auteurs : Nazim Fatès [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This text presents some notes on the classification of simple rules in one and two dimensions. We focus on the 256 Elementary Cellular Automata and the 64 totalistic rules with von Neumann neighbourhood. The updating scheme is fully asynchronous updating, that is, only one cell is updated randomly and uniformly at each time step. While a partial classification of such rules has been proposed some years ago, very few progress has been made since then. In order to spot the obstacles to a complete classification, we here mainly adopt an experimental approach based on the observations of the space-time diagrams. We also give some sketch of proofs when possible and underline the interesting open problems.
Url:
DOI: 10.1007/978-3-642-40867-0_3
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000063
- to stream Istex, to step Curation: 000063
- to stream Istex, to step Checkpoint: 000290
- to stream Hal, to step Corpus: 000807
- to stream Hal, to step Curation: 000807
- to stream Hal, to step Checkpoint: 000F26
- to stream Main, to step Merge: 001676
- to stream Main, to step Curation: 001664
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Note on the Classification of the Most Simple Asynchronous Cellular Automata</title><author><name sortKey="Fates, Nazim" sort="Fates, Nazim" uniqKey="Fates N" first="Nazim" last="Fatès">Nazim Fatès</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:02F3BC4CB9F2CB3D3739CFCCD8B1598FE01BB65B</idno><date when="2013" year="2013">2013</date><idno type="doi">10.1007/978-3-642-40867-0_3</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-GD3GG5R4-W/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">000063</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">000063</idno><idno type="wicri:Area/Istex/Curation">000063</idno><idno type="wicri:Area/Istex/Checkpoint">000290</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000290</idno><idno type="wicri:doubleKey">0302-9743:2013:Fates N:a:note:on</idno><idno type="wicri:source">HAL</idno><idno type="RBID">Hal:hal-00981691</idno><idno type="url">https://hal.inria.fr/hal-00981691</idno><idno type="wicri:Area/Hal/Corpus">000807</idno><idno type="wicri:Area/Hal/Curation">000807</idno><idno type="wicri:Area/Hal/Checkpoint">000F26</idno><idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">000F26</idno><idno type="wicri:Area/Main/Merge">001676</idno><idno type="wicri:Area/Main/Curation">001664</idno><idno type="wicri:Area/Main/Exploration">001664</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Note on the Classification of the Most Simple Asynchronous Cellular Automata</title><author><name sortKey="Fates, Nazim" sort="Fates, Nazim" uniqKey="Fates N" first="Nazim" last="Fatès">Nazim Fatès</name><affiliation wicri:level="1"><country xml:lang="fr">France</country><wicri:regionArea>LORIA UMR 7503, Inria Nancy Grand-Est, 54 600, Villers-lès-Nancy</wicri:regionArea><wicri:noRegion>Villers-lès-Nancy</wicri:noRegion><wicri:noRegion>Villers-lès-Nancy</wicri:noRegion></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This text presents some notes on the classification of simple rules in one and two dimensions. We focus on the 256 Elementary Cellular Automata and the 64 totalistic rules with von Neumann neighbourhood. The updating scheme is fully asynchronous updating, that is, only one cell is updated randomly and uniformly at each time step. While a partial classification of such rules has been proposed some years ago, very few progress has been made since then. In order to spot the obstacles to a complete classification, we here mainly adopt an experimental approach based on the observations of the space-time diagrams. We also give some sketch of proofs when possible and underline the interesting open problems.</div></front></TEI><affiliations><list><country><li>France</li></country></list><tree><country name="France"><noRegion><name sortKey="Fates, Nazim" sort="Fates, Nazim" uniqKey="Fates N" first="Nazim" last="Fatès">Nazim Fatès</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001664 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001664 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:02F3BC4CB9F2CB3D3739CFCCD8B1598FE01BB65B
|texte= A Note on the Classification of the Most Simple Asynchronous Cellular Automata
}}
| This area was generated with Dilib version V0.6.33. |  |